join graph造句

• It converts the ordinary task graph into fork and join graph , then apply the optimized result of fork and join graph to the scheduling of general task graph . tdmscl converts task scheduling process into the process of optimizing a topological sequence
  该算法把普通任务图转换为join与fork等基本形状,然后运用对join图与fork图的优化调度研究结果对这些基本形状进行任务调度。
• Using the combinatorial method of constructibility and the technique of exchanging colors , we present the best upper bounds of dynamic chromatic number of halin graphs and sp graphs , and determine the dynamic chromatic number of a type of sp graphs , we determine the incidence chromatic number of some descartes product graphs and some join graphs . at last we determine the entire coloring number of 1 - tree and prove a conjecture of edge - face coloring
  利用构造性组合方法和换色技巧给出了halin图和系列平行图动态色数的最小上界，并确定了一类特殊系列平行图的动态色数，确定了某些笛卡儿积图和某些联图的关联色数，确定了1 -树图的完备色数并证明了有关边面着色的一个猜想。
• Finally it describes a new network task scheduling algorithm which considers both throughput and latency . the contributions of this paper are as below : proposed a new duplication based task scheduling algorithm for fork - join graph considering the communication limits between different processors , named tdc _ fj . the test results show that tdc _ fj is flexible and effective for fork - join graph and it achieves good performance and reduces the requirements of processors
  本文主要贡献如下:提出了满足通信限制的基于复制的优化fork - join调度算法tdc _ fj , tdc _ fj利用基于复制的fork - join最优化调度结果来对fork - join任务图进行调度,并且在调度过程中加入处理器之间的通信限制,也就是一条通信信道不能同时被两个通信事件占用。